Enhanced Static Modulated Fourier Transform Spectrometer for Fast Approximation in Field Application
نویسندگان
چکیده
منابع مشابه
The (finite field) Fast Fourier Transform
There are numerous directions from which one can approach the subject of the fast Fourier Transform (FFT). It can be explained via numerous connections to convolution, signal processing, and various other properties and applications of the algorithm. We (along with Geddes/Czapor/Labahn) take a rather simple view from the algebraic manipulation standpoint. As will be apparent shortly, we relate ...
متن کاملThe (finite field) Fast Fourier Transform
There are numerous directions from which one can approach the subject of the fast Fourier Transform (FFT). It can be explained via numerous connections to convolution, signal processing, and various other properties and applications of the algorithm. We (along with Geddes/Czapor/Labahn) take a rather simple view from the algebraic manipulation standpoint. As will be apparent shortly, we relate ...
متن کاملBirefringent Fourier-transform imaging spectrometer.
Fourier-transform imaging spectrometers offer important advantages over other spectral imaging modalities, such as, a wider free spectral range, higher spectral resolutions and, in low-photon-flux conditions, higher signal-to-noise ratios can be achieved. Unfortunately, for application in harsh environments, deployment of Fourier-transform instruments based on traditional moving-mirror interfer...
متن کاملElectro-optically modulated polarizing Fourier-transform spectrometer for plasma spectroscopy applications.
A new electro-optically modulated optical solid-state (MOSS) interferometer has been constructed for measurement of quantities related to the low-order spectral moments of line emission from optically thin radiant media such as plasmas. When Doppler broadening is dominant, the spectral moments give the Radon transform of corresponding moments of the velocity distribution function of the radiati...
متن کاملAnalyzing the Approximation Error of the Fast Graph Fourier Transform
The graph Fourier transform (GFT) is in general dense and requires O(n) time to compute and O(n) memory space to store. In this paper, we pursue our previous work on the approximate fast graph Fourier transform (FGFT). The FGFT is computed via a truncated Jacobi algorithm, and is defined as the product of J Givens rotations (very sparse orthogonal matrices). The truncation parameter, J , repres...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Molecules
سال: 2021
ISSN: 1420-3049
DOI: 10.3390/molecules26113312